%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEV225^5 : TPTP v8.1.2. Bugfixed v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 19:24:32 EDT 2023

% Result   : Theorem 3.37s 3.77s
% Output   : Proof 3.37s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEV225^5 : TPTP v8.1.2. Bugfixed v5.3.0.
% 0.00/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Thu Aug 24 03:17:02 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 3.37/3.77  SZS status Theorem for theBenchmark.p
% 3.37/3.77  SZS output start Proof for theBenchmark.p
% 3.37/3.77  Clause #0 (by assumption #[]): Eq (Eq cIRREFLEXIVE_LAW (∀ (Xx : r), Not (less Xx Xx))) True
% 3.37/3.77  Clause #1 (by assumption #[]): Eq (Not (cIRREFLEXIVE_LAW → ∀ (Xx : r), Not (And (less Xx c0) (Eq Xx c0)))) True
% 3.37/3.77  Clause #2 (by clausification #[0]): Eq cIRREFLEXIVE_LAW (∀ (Xx : r), Not (less Xx Xx))
% 3.37/3.77  Clause #4 (by clausify Prop equality #[2]): Or (Eq cIRREFLEXIVE_LAW False) (Eq (∀ (Xx : r), Not (less Xx Xx)) True)
% 3.37/3.77  Clause #6 (by clausification #[4]): ∀ (a : r), Or (Eq cIRREFLEXIVE_LAW False) (Eq (Not (less a a)) True)
% 3.37/3.77  Clause #7 (by clausification #[6]): ∀ (a : r), Or (Eq cIRREFLEXIVE_LAW False) (Eq (less a a) False)
% 3.37/3.77  Clause #11 (by clausification #[1]): Eq (cIRREFLEXIVE_LAW → ∀ (Xx : r), Not (And (less Xx c0) (Eq Xx c0))) False
% 3.37/3.77  Clause #12 (by clausification #[11]): Eq cIRREFLEXIVE_LAW True
% 3.37/3.77  Clause #13 (by clausification #[11]): Eq (∀ (Xx : r), Not (And (less Xx c0) (Eq Xx c0))) False
% 3.37/3.77  Clause #15 (by backward demodulation #[12, 7]): ∀ (a : r), Or (Eq True False) (Eq (less a a) False)
% 3.37/3.77  Clause #17 (by clausification #[13]): ∀ (a : r), Eq (Not (Not (And (less (skS.0 1 a) c0) (Eq (skS.0 1 a) c0)))) True
% 3.37/3.77  Clause #18 (by clausification #[17]): ∀ (a : r), Eq (Not (And (less (skS.0 1 a) c0) (Eq (skS.0 1 a) c0))) False
% 3.37/3.77  Clause #19 (by clausification #[18]): ∀ (a : r), Eq (And (less (skS.0 1 a) c0) (Eq (skS.0 1 a) c0)) True
% 3.37/3.77  Clause #20 (by clausification #[19]): ∀ (a : r), Eq (Eq (skS.0 1 a) c0) True
% 3.37/3.77  Clause #21 (by clausification #[19]): ∀ (a : r), Eq (less (skS.0 1 a) c0) True
% 3.37/3.77  Clause #22 (by clausification #[20]): ∀ (a : r), Eq (skS.0 1 a) c0
% 3.37/3.77  Clause #23 (by clausification #[15]): ∀ (a : r), Eq (less a a) False
% 3.37/3.77  Clause #25 (by forward demodulation #[21, 22]): Eq (less c0 c0) True
% 3.37/3.77  Clause #26 (by superposition #[25, 23]): Eq True False
% 3.37/3.77  Clause #27 (by clausification #[26]): False
% 3.37/3.77  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------